Robustness of randomized rumour spreading
نویسندگان
چکیده
منابع مشابه
Quasirandom Rumour Spreading on the Complete Graph Is as Fast as Randomized Rumour Spreading
In this paper, we provide a detailed comparison between a fully randomized protocol for rumour spreading on a complete graph and a quasirandom protocol introduced by Doerr, Friedrich and Sauerwald (2008). In the former, initially there is one vertex which holds a piece of information and during each round every one of the informed vertices chooses one of its neighbours uniformly at random and i...
متن کاملRandomized Rumour Spreading: The Effect of the Network Topology
We consider the popular and well-studied push model, which is used to spread information in a given network with n vertices. Initially, some vertex owns a rumor and passes it to one of its neighbors, which is chosen randomly. In each of the succeeding rounds, every vertex that knows the rumor informs a random neighbor. It has been shown on various network topologies that this algorithm succeeds...
متن کاملRumour spreading on graphs
How does gossip spread? How do technologies diffuse within or across societies? How do fads and fashions take hold? How do people learn about job opportunities or recruit workers? All these are examples of information spread over social networks, networks of friendship, family and acquaintance. They play a role in everything from the smooth functioning of economies to the maintenance of social ...
متن کاملStrong Robustness of Randomized Rumor Spreading Protocols
Randomized rumor spreading is a classical protocol to disseminate information across a network. At SODA 2008, a quasirandom version of this protocol was proposed and competitive bounds for its runtime were proven. This prompts the question: to what extent does the quasirandom protocol inherit the second principal advantage of randomized rumor spreading, namely robustness against transmission fa...
متن کاملTheory of Rumour Spreading in Complex Social Networks
We introduce a general stochastic model for the spread of rumours, and derive mean-field equations that describe the dynamics of the model on complex social networks (in particular, those mediated by the Internet). We use analytical and numerical solutions of these equations to examine the threshold behaviour and dynamics of the model on several models of such networks: random graphs, uncorrela...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Combinatorics, Probability and Computing
سال: 2020
ISSN: 0963-5483,1469-2163
DOI: 10.1017/s0963548320000310